A Secure and Low Cost Range-Free Localization Algorithm for Mobile Sensor Networks

In these days, it is very important to trace a mobile in the vast mobile sensor network. It is mainly for identifying the location of the person who is using that mobile. For this application, the location of the mobile node (mobile) is to be found. This process is known as localization. Out of different types of localization techniques, range-free localization approaches are cost-effective for mobile sensor networks (because no additional hardware support is required). Due to economic considerations, mobile sensor networks typically have sparse anchor nodes which make most range-free localization algorithms inaccurate. On the other hand, due to the power limitation of mobile sensor nodes (i.e., they are battery-operated) and high power consumption by communication, high communication cost will significantly reduce the network life time. For solving these two problems, historical beacons (i.e., anchor nodes’ announcements delivered in previous time slots) and received signal strength (RSS) are used to derive three constraints. By the aid of the three constraints, introduced a low-communication-cost range-free localization algorithm (only one-hop beacon broadcasting is required).Also extended this project by adding a data discovery and dissemination protocol. This makes the system free from vulnerabilities.